Add to ORKGInternational audienceImplicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of computation, and by internalizing the bounds rather than using external measure. We survey how automata theory contributed to complexity with a machine-dependant with implicit bounds model
International audienceCellular automata (CA) comprise a simple and well-formalized model of massivel...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized i...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
This thesis examines the nature of complexity in automata networks, andin particular, the necessary ...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
The algebraic theory of finite automata has been one of the most successful tools to study and class...
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We argue that there is a link between implicit computational complexity theory and reversible comput...
International audienceThis chapter presents a brief introduction to the theory of automata, formal l...
We argue that there is a link between implicit computational complexity theory and the theory of rev...
We describe three orthogonal complexity measures: parallel time, amount of hardware, and degree of n...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
Implicit computational complexity (ICC) studies machine-independent approaches to computational comp...
International audienceCellular automata (CA) comprise a simple and well-formalized model of massivel...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized i...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
This thesis examines the nature of complexity in automata networks, andin particular, the necessary ...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
The algebraic theory of finite automata has been one of the most successful tools to study and class...
Slower paced than 6.840J/18.404J. Introduces basic mathematical models of computation and the finite...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We argue that there is a link between implicit computational complexity theory and reversible comput...
International audienceThis chapter presents a brief introduction to the theory of automata, formal l...
We argue that there is a link between implicit computational complexity theory and the theory of rev...
We describe three orthogonal complexity measures: parallel time, amount of hardware, and degree of n...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
Implicit computational complexity (ICC) studies machine-independent approaches to computational comp...
International audienceCellular automata (CA) comprise a simple and well-formalized model of massivel...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized i...